Reasoning and Planning with Incomplete Information in the Presence of Static Causal Laws by Tu Huy Phan

نویسندگان

  • Linda Lacey
  • Son Cao Tran
  • Enrico Pontelli
  • Xin Zhang
  • Yu Pan
  • Ricardo Morales
چکیده

REASONING AND PLANNING WITH INCOMPLETE INFORMATION IN THE PRESENCE OF STATIC CAUSAL LAWS BY TU HUY PHAN Doctor of Philosophy New Mexico State University Las Cruces, New Mexico, 2007 Dr. Son Cao Tran, Chair This dissertation extends the framework of the 0-approximation to handle domains with static causal laws. It is divided into three parts. In the first part, we present a sufficient condition for the completeness of the 0-approximation and propose a new method to achieve complete reasoning and planning with the 0-approximation. In the second part, we tackle the problem of designing approximations for domains with static causal laws. Specifically, we present two different approaches to the problem which result in four different approximations. In the last part, we extend the approximations to incorporate sensing actions. In each part, the results are evaluated through the development of conformant or conditional planner(s).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning and Planning with Sensing Actions , Incomplete Information , and Static Causal Laws using Answer Set Programming PHAN

We extend the 0-approximation of sensing actions and incomplete information in (Son and Baral 2001) to action theories with static causal laws and prove its soundness with respect to the possible world semantics. We also show that the conditional planning problem with respect to this approximation is NP-complete. We then present an answer set programming based conditional planner, called ASCP, ...

متن کامل

Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming

We extend the 0-approximation of sensing actions and incomplete information in (Son and Baral 2001) to action theories with static causal laws and prove its soundness with respect to the possible world semantics. We also show that the conditional planning problem with respect to this approximation is NP-complete. We then present an answer set programming based conditional planner, called ASCP, ...

متن کامل

On the Completeness of Approximation Based Reasoning and Planning in Action Theories with Incomplete Information

In this paper, we study the completeness of the 0approximation for action theories with incomplete information. We propose a sufficient condition for which an action theory under the 0-approximation semantics is complete with respect to the possible world semantics. We then introduce the notion of decisive sets of fluents, based on which an action theory can be modified into another action theo...

متن کامل

Planning with Sensing Actions and Incomplete Information Using Logic Programming

We present a logic programming based conditional planner that is capable of generating both conditional plans and conformant plans in the presence of sensing actions and incomplete information. We prove the correctness of our implementation and show that our planner is complete with respect to the 0approximation of sensing actions and the class of conditional plans considered in this paper. Fin...

متن کامل

An Extension to Conformant Planning Using Logic Programming

In this paper we extend the logic programming based conformant planner described in [Son et al., 2005a] to allow it to work on planning problems with more complex descriptions of the initial states. We also compare the extended planner with other concurrent conformant planners.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007